Message and State Cooperation in a Relay Channel When Only the Relay Knows the State

نویسندگان

  • Min Li
  • Osvaldo Simeone
  • Aylin Yener
چکیده

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects the source and the relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between the source and the relay on transmission of message and state information to the destination. First, two achievable schemes are proposed that exploit both message and state cooperation. It is shown that a transmission scheme inspired by noisy network coding performs better than a strategy based on block Markov coding and backward decoding. Next, based on the given achievable schemes and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Study of Untrusted Relay Network Utilizing Cooperative Jammer

Abstract—In this paper, the problem of secure transmission in two-hop amplify-and-forward (AF) systems with an untrusted relay is investigated. To prevent the untrusted relay from intercepting the source message and to achieve positive secrecy rate, the destination-based cooperative jamming (DBCJ) technique is used. In this method the destination sends an intended jamming signal to the relay. T...

متن کامل

Cooperation and Optimal Cross-layer Resource Allocation in Wireless Networks a Dissertation Submitted to the Department of Electrical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

In wireless networks, we can improve system performance by exploiting cooperative communications, where neighbor nodes may interact to jointly encode, decode, or relay information. In this thesis, we show that cooperation can improve capacity, but only when the right cooperation strategy is chosen based on the network topology, signal-to-noise ratio (SNR), channel state information (CSI), and p...

متن کامل

Power Allocation Strategies in Block-Fading Two-Way Relay Networks

This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...

متن کامل

Rateless Coding over Wireless Relay Networks Using Amplify/Decode and Forward Relays

In this paper two different rateless transmissionschemes are developed. In the proposed scheme, relay node candecode and forward the message to the destination if they areable to decode it, or amplify and forward the message to thedestination. Based on the analysis and simulation resultsprovided in this paper, the proposed method has bettertransmission time than the scheme which only the relay ...

متن کامل

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1102.0768  شماره 

صفحات  -

تاریخ انتشار 2011